@Article{Test1,
author = {Test Author and Test AU},
title = {A Test Title of the Article},
journal = {The Journal of Test TeX},
year = {2010},
volume = {33},
number = {2},
pages = {202-215},
month = {January}
}

@Article{JIT_1,
author = {Kenneth R. Baker and Gary D. Scudder},
title = {Sequencing with earliness and tardiness penalties: a review},
journal = {Operations Research},
year = {1990},
volume = {38},
number = {1},
pages = {22-36},
month = {Jan.-Feb.}
}

@Article{SetupReview,
author = {T. C. Edwin Cheng and Jatinder N. D. Gupta and Guoqing Wang},
title = {A Review of Flowshop Scheduling Research with Setup Times},
journal = {Production and Operations Management},
year = {2000},
volume = {9},
number = {3},
pages = {262-282}
}

@Article{1st-study-setups,
author = {Burton D. Corwin and Augustine O. Esogbue},
title = {Two-machine flowshop scheduling problems with sequence dependent setup times: a dynamic programming approach},
journal = {Naval Research Logistics Quarterly},
year = {1974},
volume = {21},
number = {3},
pages = {515-524},
}

@Article{key-1,
author = {Tamer Eren},
title = {A bi-criteria m-machine flow shop scheduling with sequence-dependent setup times},
journal = {Applied Mathematical Modelling},
year = {2010},
volume = {34},
number = {2},
pages = {284-293},
month = {Feb.}
}

@Book{Holland,
author = {John H. Holland},
title = {Adaptation in Natural and Artificial Systems},
publisher = {The University of Michigan Press},
year = {1975},
address = {Ann Arbor, Michigan}
}

@Article{key-4,
author = {Ond\v{r}ej Hrstka and Anna Ku\v{c}erov},
title = {Improvements of real coded genetic algorithms based on differential operators preventing premature convergence},
journal = {Advances in Engineering Software},
year = {2004},
volume = {35},
number = {3-4},
pages = {237-246},
month = {March}
}

@Article{key-2,
author = {J.K. Lenstra and A.H.G. Rinnooy Kan and P. Brucker},
title = {Complexity of machine scheduling problems},
journal = {Annals of Discrete Mathematics},
year = {1977},
volume = {1},
pages = {343-262},
}

@Book{INV,
author = {Zbigniew Michalewicz},
title = {Genetic algorithms + data structures = evolution programs},
publisher = {Springer},
year = {1996},
address = {Berlin},
edition = {2nd}
}

@InProceedings{key-5,
    author = {Brad Miller and Brad L. Miller and Michael J. Shaw},
    title = {Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization},
    booktitle = {IEEE International Conference on Evolutionary Computation},
    year = {1996},
    pages = {786-791}
}

@Article{key-3,
author = {Rub\'{e}n Ruiz and Concepci\'{o}n Maroto},
title = {A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility},
journal = {European Journal of Operational Research},
year = {2006},
volume = {169},
number = {3},
pages = {781-800},
month = {March}
}


@Article{SAD,
author = {H\"{u}seyin Sarper},
title = {Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem},
journal = {Applied Mathematical Modelling},
year = {1995},
volume = {19},
number = {3},
pages = {153-161},
month = {March}
}

@Article{Famous_crossover,
author = {D.-Z. Zheng and L. Wang},
title = {An effective hybrid heuristic for flow shop scheduling},
journal = {The International Journal of Advanced manufacturing Technology},
year = {2003},
volume = {21},
number = {1},
pages = {38-44},
month = {January}
}

@Article{due_window,
author = {Wing-Kwan Yeung and Ceyda O\u{g}uz and Tai-Chiu Edwin Cheng},
title = {Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs},
journal = {Naval Research Logistics},
year = {2009},
volume = {56},
number = {7},
pages = {593-599},
month = {August}
}
@Article{Three-Field,
author = {R.L. Graham and E.L. Lawler and J.K. Lenstra and A.H.G. Rinnooy Kan},
title = {Optimization and approximation in deterministic sequencing and scheduling: a survey},
journal = {Annals of Discrete Mathematics},
year = {1979},
volume = {5},
OPTnumber = {•},
pages = {287-326}
}
@Book{The-Schedule-Book,
author = {Michael Pinedo},
title = {Scheduling: Theory, Algorithms, and Systems},
publisher = {Prentice-Hall, Inc.},
year = {2000},
edition = {Second},
pages = {13-32}
}

@article{Biskup2005740,
title = "On scheduling around large restrictive common due windows",
journal = "European Journal of Operational Research",
volume = "162",
number = "3",
pages = "740 - 761",
year = "2005",
author = "Dirk Biskup and Martin Feldmann",
keywords = "Scheduling",
keywords = "Common due window",
keywords = "Mapping",
keywords = "Meta-heuristic",
abstract = "
This paper deals with the problem of scheduling a number of jobs on a single machine around a large, restrictive common due window. We consider individual earliness and tardiness penalties for the jobs. The objective is to find an optimal schedule which jointly minimizes the sum of the earliness and tardiness penalties. This problem is intractable and hence no efficient procedure for solving large instances is expected to be found. For this reason we first introduced a mapping of the problem which takes advantage of the structural properties inherent to optimal solutions. Secondly we solved the problem under study by using this mapping and applying three meta-heuristics, namely evolutionary strategy, simulated annealing and threshold accepting. To validate the quality of these approaches, altogether 250 benchmark problems with different window sizes and positions of up to 200 jobs are examined. Furthermore small instances are solved to optimality by a mixed integer programming formulation."
}